Handshakes Across a (Round) Table

نویسنده

  • Tomislav Došlić
چکیده

We establish an explicit formula for the number of chord diagrams on 2n points with k short chords and compute the expected number of short chords in a chord diagram.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RFC 5325 LTP - Motivation September 2008 2

This document describes the motivation for the development of the Licklider Transmission Protocol (LTP) designed to provide retransmission-based reliability over links characterized by extremely long message round-trip times (RTTs) and/or frequent interruptions in connectivity. Since communication across interplanetary space is the most prominent example of this sort of environment, LTP is prin...

متن کامل

Cryptanalysis of Efficient Unlinkable Secret Handshakes for Anonymous Communications

Several unlinkable secret handshakes schemes have been proposed in recent years. As performing the successful secret handshakes is essentially equivalent to computing a common key between two interactive members of the same group. Therefore secret handshakes scheme is a key agreement protocol between two members of the same group. So it is necessary for a secret handshakes scheme to fulfill sec...

متن کامل

A social chemosignaling function for human handshaking

Social chemosignaling is a part of human behavior, but how chemosignals transfer from one individual to another is unknown. In turn, humans greet each other with handshakes, but the functional antecedents of this behavior remain unclear. To ask whether handshakes are used to sample conspecific social chemosignals, we covertly filmed 271 subjects within a structured greeting event either with or...

متن کامل

Fast-Track Session Establishment for TLS

We propose a new, “fast-track” handshake mechanism for TLS. A fast-track client caches a server’s public parameters and negotiated parameters in the course of an initial, enabling handshake. These parameters need not be resent on subsequent handshakes. The new mechanism reduces both network traffic and the number of round trips, and requires no additional server state. These savings are most us...

متن کامل

Optionally Identifiable Private Handshakes

It is now a trend that Internet users are increasingly concerned about individual privacy, and as a result numerous privacy-preserving authentication techniques have been proposed. In this paper, we propose the concept of private handshakes with optional identifiability, which allows the two users in a handshake deciding real time to either proceed their interaction as secret handshake or as pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010